Coded Caching for Combination Networks with Multiaccess

In a traditional (H,r) combination network, each user connects to unique set of r relays. However, few research efforts have considered the (H,r,u) multiaccess network problem wherein relays is connected by u users. this paper, we focus on designing coded caching schemes for network. By directly applying well-known coding method (proposed Zewail and Yener) scheme (called ZY scheme) obtained. its subpacketization has an exponential order with number users which leads high implementation complexity. reduce subpacketization, direct construction proposed means combinational design theory, where parameter must be combinatorial number. For arbitrary u, hybrid based scheme. Theoretical numerical analysis shows that smaller transmission load relay compared naive (which obtained repeatedly times) much lower